Decomposable multi-parameter matroid optimization problems
نویسندگان
چکیده
منابع مشابه
A Parameterized View on Matroid Optimization Problems
Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomialtime algorithms. However, several natural matroid problems, such as 3-matroid intersection, are NP-hard. Here we investigate these problems from the parameterized complexity point of view: instead of the trivial O(n) time brute force algorithm for finding a k-element sol...
متن کاملSubgradient Optimization, Matroid Problems and Heuristic Evaluation
Many polynomial complete problems can be reduced efficiently to three matroids intersection problems. Subgradient methods are shown to yield very good algorithms for computing tight lower bounds to the solution of these problems. The bounds may be used either to construct heuristically guided (branch-and-bound) methods for solving the problems, or to obtain an upper bound to the difference betw...
متن کاملMatroid Secretary for Regular and Decomposable Matroids
In the matroid secretary problem we are given a stream of elements in random order and asked to choose a set of elements that maximizes the total value of the set, subject to being an independent set of a matroid given in advance. The difficulty comes from the assumption that decisions are irrevocable: if we choose to accept an element when it is presented by the stream then we can never get ri...
متن کاملMulti-objective Phylogenetic Algorithm: Solving Multi-objective Decomposable Deceptive Problems
In general, Multi-objective Evolutionary Algorithms do not guarantee find solutions in the Pareto-optimal set. We propose a new approach for solving decomposable deceptive multi-objective problems that can find all solutions of the Pareto-optimal set. Basically, the proposed approach starts by decomposing the problem into subproblems and, then, combining the found solutions. The resultant appro...
متن کاملMulti-parameter Mechanism Design under Budget and Matroid Constraints
The design of truthful auctions that approximate the optimal expected revenue is a central problem in algorithmic mechanism design. 30 years after Myerson’s characterization of Bayesian optimal auctions in single-parameter domains [9], characterizing but also providing efficient mechanisms for multi-parameter domains still remains a very important unsolved problem. Our work improves upon recent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00638-2